Small-buffer networks

نویسندگان

  • Mark Shifrin
  • Isaac Keslassy
چکیده

Today, because of TCP dynamics, Internet backbone routers hold large packet buffers, which significantly increase their power consumption and design time. Recent models of large-buffer networks have suggested that these large buffers could be replaced with much smaller ones. Unfortunately, it turns out that these largebuffer network models are not valid anymore in small-buffer networks, and therefore cannot predict how these small-buffer networks will behave. In this paper, we introduce a new model that provides a complete statistical description of small-buffer Internet networks. We present novel models of the distributions of several network components, such as the line occupancies of each flow, the instantaneous arrival rates to the bottleneck queues, and the bottleneck queue sizes. Later, we combine all these models in a single fixed-point algorithm that forms the key to a global statistical small-buffer network model. In particular, given some QoS requirements, we show how this new model can be used to precisely size small buffers in backbone router designs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliable Flow Control Coding in Low-Buffer Grid Networks

We consider a grid network where nodes contain small buffers. A packet that faces a crowded buffer in its route will get extra latency and may be dropped. In this paper, we propose a novel flow control protocol called RFCC for grid networks. RFCC tries to reroute delayed packets and utilizes network coding to introduce a configurable amount of redundant information in the network, thereby incre...

متن کامل

Reliable Flow Control Coding in Low-Buffer Grid Networks

We consider a grid network where nodes contain small buffers. A packet that faces a crowded buffer in its route will get extra latency and may be dropped. In this paper, we propose a novel flow control protocol called RFCC for grid networks. RFCC tries to reroute delayed packets and utilizes network coding to introduce a configurable amount of redundant information in the network, thereby incre...

متن کامل

M1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)

In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...

متن کامل

Modeling TCP in Small-Buffer Networks

Today, the large packet buffers present in backbone routers significantly increase their power consumption and design time. Recent models of networks with large buffers have suggested that these large buffers could be replaced with much smaller ones. Unfortunately, it turns out that these models are not valid anymore in networks with small buffers, and therefore cannot predict how these small-b...

متن کامل

New CMT-SCTP with increased speed of data transmission

Communication protocols issues are one of the effective factors in communicated networks performance. One of challenging problem in CMT-SCTP which sends data by multipath concurrently is Receive Buffer Blocking. This problem has important role in data transmission speed in computer networks. In this paper, we propose a control method based on fuzzy logic so that can solve Receive Buffer Blockin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Networks

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2009